R-MATRICES AND THE TENSOR PRODUCT GRAPH METHOD
نویسندگان
چکیده
منابع مشابه
R-matrices and the Tensor Product Graph Method
A systematic method for constructing trigonometric R-matrices corresponding to the (multiplicity-free) tensor product of any two affinizable representations of a quantum algebra or superalgebra has been developed by the Brisbane group and its collaborators. This method has been referred to as the Tensor Product Graph Method. Here we describe applications of this method to untwisted and twisted ...
متن کاملMulti-Label Learning on Tensor Product Graph
A large family of graph-based semi-supervised algorithms have been developed intuitively and pragmatically for the multi-label learning problem. These methods, however, only implicitly exploited the label correlation, as either part of graph weight or an additional constraint, to improve overall classification performance. Despite their seemingly quite different formulations, we show that all e...
متن کاملHermitian Tensor Product Approximation of Complex Matrices and Separability
The quantum entangled states have become one of the key resources in quantum information processing. The study of quantum teleportation, quantum cryptography, quantum dense coding, quantum error correction and parallel computation [1, 2, 3] has spurred a flurry of activities in the investigation of quantum entanglements. Despite the potential applications of quantum entangled states, the theory...
متن کاملA Survey on Semi-Tensor Product of Matrices
Semi-tensor product of matrices is a generalization of conventional matrix product for the case when the two factor matrices do not meet the dimension matching condition. It was firstly proposed about ten years ago. Since then it has been developed and applied to several different fields. In this paper we will first give a brief introduction. Then give a survey on its applications to dynamic sy...
متن کاملOptimal orientation of the tensor product of a small diameter graph and a complete graph
For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G, denoted by d(G), is defined as min{d(D) | D ∈ D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, a sufficient condition is given for d(G×Kn) = d(G×Kn), where G is a graph with d(G) two or three and × is the tensor product of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics B
سال: 2002
ISSN: 0217-9792,1793-6578
DOI: 10.1142/s0217979202011901